منابع مشابه
PageRank in Undirected Random Graphs
PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning. In this paper, we study PageRank in undirected random graphs with an expansion property. The Chung-Lu random graph is an example of such a graph. We show that in the limit, as the size of the graph goes to infinity, PageRank can be approximated by a mixture of the restart d...
متن کاملVerifying Nash Equilibria in PageRank Games on Undirected Web Graphs
J. Hopcroft and D. Sheldon originally introduced the PageRank game to investigate the self-interested behavior of web authors who want to boost their PageRank by using game theoretical approaches. The PageRank game is a multiplayer game where players are the nodes in a directed web graph and they place their outlinks to maximize their PageRank value. They give best response strategies for each ...
متن کاملRandom Walks on Undirected Graphs
Thus the probability that the process is in a particular “state” y at time t depends only on its state x at time t − 1; this probability is denoted P (x, y), and is independent of t. The values P (x, y) are called the transition probabilities of the chain. We can also think of a Markov chain as a process on a directed graph G = (V,E), where V is the range of values taken by the Xt (assumed disc...
متن کاملA Note on the PageRank of Undirected Graphs
The PageRank is a widely used scoring function of networks in general and of the World Wide Web graph in particular. The PageRank is defined for directed graphs, but in some special cases applications for undirected graphs occur. In the literature it is widely noted that the PageRank for undirected graphs are proportional to the degrees of the vertices of the graph. We prove that statement for ...
متن کاملPageRank in Scale-Free Random Graphs
We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity it can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in turn related to the solution of a linear stochastic fixed point equation that has been thoroughly studied in the recent literature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2017
ISSN: 1944-9488
DOI: 10.24166/im.09.2017